New quantum codes from constacyclic codes over the ring $ R_{k,m} $

نویسندگان

چکیده

<p style='text-indent:20px;'>For any odd prime <inline-formula><tex-math id="M2">\begin{document}$ p $\end{document}</tex-math></inline-formula>, we study constacyclic codes of length id="M3">\begin{document}$ n $\end{document}</tex-math></inline-formula> over the finite commutative non-chain ring id="M4">\begin{document}$ R_{k,m} = \mathbb{F}_{p^m}[u_1,u_2,\dots,u_k]/\langle u^2_i-1,u_iu_j-u_ju_i\rangle_{i\neq j 1,2,\dots,k} where id="M5">\begin{document}$ m,k\geq 1 are integers. We determine necessary and sufficient condition for these to contain their Euclidean duals. As an application, from dual containing codes, several MDS, new better quantum compare best known in literature obtained.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

New Quantum MDS codes constructed from Constacyclic codes

Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form q = 2am + t, n = q 2 +1 a . Most of these quantum MDS codes are new in the sense that their parameters are not covered be the codes available in the literature.

متن کامل

New quantum MDS codes derived from constacyclic codes

Quantum error-correcting codes play an important role in both quantum communication and quantum computation. It has experienced a great progress since the establishment of the connections between quantum codes and classical codes (see [4]). It was shown that the construction of quantum codes can be reduced to that of classical linear error-correcting codes with certain self-orthogonality proper...

متن کامل

New linear codes from constacyclic codes

One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...

متن کامل

Cyclic and constacyclic codes over a non-chain ring

In this study, we consider linear and especially cyclic codes over the non-chain ring Zp[v]/〈v − v〉 where p is a prime. This is a generalization of the case p = 3. Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and p-ary codes and moreover this map enlighte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2022

ISSN: ['1930-5346', '1930-5338']

DOI: https://doi.org/10.3934/amc.2020097